Privacy-preserving horizontally partitioned linear programs
نویسنده
چکیده
We propose a simple privacy-preserving reformulation of a linear program whose equality constraint matrix is partitioned into groups of rows. Each group of matrix rows and its corresponding right hand side vector are owned by a distinct private entity that is unwilling to share or make public its row group or right hand side vector. By multiplying each privately held constraint group by an appropriately generated and privately held random matrix, the original linear program is transformed into an equivalent one that does not reveal any of the privately held data or make it public. The solution vector of the transformed secure linear program is publicly generated and is available to all entities.
منابع مشابه
Privacy-preserving horizontally partitioned linear programs with inequality constraints
In this paper we solve the open problem, finding the solutions for privacy-preserving horizontally partitioned linear programs with inequality constraints, proposed recently by Mangasarian, O.L. ( Privacy-preserving horizontally partitioned linear programs, Optim Lett 2011, to appear).
متن کاملAn inference-proof approach to privacy-preserving horizontally partitioned linear programs
Mangasarian (Optim. Lett., 6(3), 431–436, 2012) proposed a constraints transformation based approach to securely solving the horizontally partitioned linear programs among multiple entities—every entity holds its own private equality constraints. More recently, Li et al. (Optim. Lett., doi:10.1007/s11590-011-0403-2, 2012) extended the transformation approach to horizontally partitioned linear p...
متن کاملPrivacy Preserving ID3 over Horizontally, Vertically and Grid Partitioned Data
We consider privacy preserving decision tree induction via ID3 in the case where the training data is horizontally or vertically distributed. Furthermore, we consider the same problem in the case where the data is both horizontally and vertically distributed, a situation we refer to as grid partitioned data. We give an algorithm for privacy preserving ID3 over horizontally partitioned data invo...
متن کاملA Novel Protocol For Privacy Preserving Decision Tree Over Horizontally Partitioned Data
In recent times, there have been growing interests on how to preserve the privacy in data mining when sources of data are distributed across multi-parties. In this paper, we focus on the privacy preserving decision tree classification in multi-party environment when data are horizontally partitioned. We develop new and simple algorithm to classify the horizontally partitioned multi-party data. ...
متن کاملPrivacy - Preserving Distributed Data Mining and Processing on Horizontally Partitioned Data
Kantarcıoğlu, Murat. Ph.D., Purdue University, August, 2005. Privacy-Preserving Distributed Data Mining and Processing on Horizontally Partitioned Data. Major Professor: Christopher W. Clifton. Data mining can extract important knowledge from large data collections, but sometimes these collections are split among various parties. Data warehousing, bringing data from multiple sources under a sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Letters
دوره 6 شماره
صفحات -
تاریخ انتشار 2012